FindStat - the combinatorial statistics database
نویسندگان
چکیده
The FindStat project provides an online platform for mathematicians, particularly for combinatorialists, to gather information about combinatorial statistics and their relations. As of January 2014, the FindStat database contains 173 statistics on 17 combinatorial collections. The project was initiated by Chris Berg and Christian Stump in 2011 at the Laboratoire de combinatoire et d’informatique mathématique, Université du Québec à Montréal, Canada. In 2013, Viviane Pons, Travis Scrimshaw, and Jessica Striker joined the project.
منابع مشابه
A Review of Statistics and Probability Journals in ISI Database
As in recent years the scientific productivity about ISI database and other related database have been increased, it is eligible for researchers of Statistics in Iran to know more about these journals and their statues in ISI database. In this study with the use of bibliometric methods, we have reviewed the status of Statistics and Probability . From all nations around the world, these are only...
متن کاملA Statistical Mechanical Approach to Combinatorial Chemistry
An analogy between combinatorial chemistry and Monte Carlo computer simulation is pursued. Examples of how to design libraries for both materials discovery and protein molecular evolution are given. For materials discovery, the concept of library redesign, or the use previous experiments to guide the design of new experiments, is introduced. For molecular evolution, examples of how to use ``bia...
متن کاملProbabilistic analysis of the asymmetric digital search trees
In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...
متن کاملConjectured Statistics for the Higher q, t-Catalan Sequences
This article describes conjectured combinatorial interpretations for the higher q, t-Catalan sequences introduced by Garsia and Haiman, which arise in the theory of symmetric functions and Macdonald polynomials. We define new combinatorial statistics generalizing those proposed by Haglund and Haiman for the original q, tCatalan sequence. We prove explicit summation formulas, bijections, and rec...
متن کاملParity Theorems for Statistics on Lattice Paths and Laguerre Configurations
We examine the parity of some statistics on lattice paths and Laguerre configurations, giving both algebraic and combinatorial treatments. For the former, we evaluate q-generating functions at q = −1; for the latter, we define appropriate parity-changing involutions on the associated structures. In addition, we furnish combinatorial proofs for a couple of related recurrences.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1401.3690 شماره
صفحات -
تاریخ انتشار 2014